Weak convergences of probability measures: A uniform principle

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak Convergence of Probability Measures

This text contains my lecture notes for the graduate course “Weak Convergence” given in September-October 2013 and then in March-May 2015. The course is based on the book Convergence of Probability Measures by Patrick Billingsley, partially covering Chapters 1-3, 5-9, 12-14, 16, as well as appendices. In this text the formula label (∗) operates locally. The visible theorem labels often show the...

متن کامل

Topics in weak convergence of probability measures

The first part of the paper deals with general features of weak star convergence from a topological point of view. We present basic facts about weak and weak star topologies, dual spaces and representations of linear functionals as Radon measures. A special attention is payed to finitely additive measures and some results regarding the Baire sets. We prove that in a wide class of topological sp...

متن کامل

On the weak closure of convex sets of Probability measures

We prove that a closed, geodesically convex subset C of P 2 (R) is closed with respect to weak convergence in P 2 (R). This means that if (μn) ⊂ C is such that μn ⇀ μ in duality with continuous bounded functions and supn ∫ |x|dμn <∞, then μ ∈ C as well.

متن کامل

Weak Convergence of Convolution Products of Probability Measures on Semihypergroups

Let S be a topological semihypergroup. As it is known for hypergroups, the lack of an algebraic structure on a semihypergroup pause a serious challenge in extending results from semigroups. We use the notion of concretization or pseudomultiplication, to prove some results on weak convergence of the sequence of averages of convolution powers of probability measures on topological semihypergroups...

متن کامل

Relating counting complexity to non-uniform probability measures

A standard method for designing randomized algorithms to approximately count the number of solutions of a problem in #P, is by constructing a rapidly mixing Markov chain converging to the uniform distribution over this set of solutions. This construction is not always an easy task, and it is conjectured that it is not always possible. We want to investigate other possibilities for using Markov ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1998

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-98-04390-1